number-on-the-forehead model

A pink papule on the forehead of a young woman

Tensor Rank and Strong Quantum Nondeterminism in Multiparty Communication

In this paper we study quantum nondeterminism in multiparty communication. There are three (possibly) different types of nondeterminism in quantum computation: i) strong, ii) weak with classical proofs, and iii) weak with quantum proofs. Here we focus on the first one. A strong quantum nondeterministic protocol accepts a correct input with positive probability, and rejects an incorrect input wi...

Separating NOF communication complexity classes RP and NP

In the number-on-forehead (NOF) model of communication complexity, k players are trying to evaluate a function F defined on kn bits. The input of F is partitioned into k pieces of n bits each, call them x1, . . . ,xk, and xi is placed, metaphorically, on the forehead of player i. Thus, each player sees (k − 1)n of the kn input bits. The players communicate by writing bits on a shared blackboard...

NOF-Multiparty Information Complexity Bounds for Pointer Jumping

We prove a lower bound on the communication complexity of pointer jumping for multiparty one-way protocols in the number on the forehead model that satisfy a certain information theoretical restriction: We consider protocols for which the ith player may only reveal information about the first i+1 inputs. To this end we extend the information complexity approach of Chakrabarti, Shi, Wirth, and Y...

Numerical simulation of flood wave propagation due to failure of dam watersheds in fluent model

By numerical simulation of the phenomenon of failure of dams and the flow of their flow, it is possible to design more precisely the structures and their location. The purpose of this study was to investigate the wave propagation phenomenon due to the failure of the rocky mortar-watering dam in the Marivan sub-basin of Zarivar in two-dimensional and three-dimensional models using the Fluent mod...